A stochastic approximation type EM algorithm for the mixture problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA stochastic EM algorithm for a semiparametric mixture model
Recently several authors considered finite mixture models with semi-/nonparametric component distributions. Identifiability of such model parameters is generally not obvious, and when it occurs, inference methods are rather specific to the mixture model under consideration. In this paper we propose a generalization of the EM algorithm to semiparametric mixture models. Our approach is methodolog...
متن کاملConvergence of a Stochastic Approximation Version of the Em Algorithm
SUMMARY The Expectation-Maximization (EM) algorithm is a powerful computational technique for locating maxima of functions. It is widely used in statistics for maximum likelihood or maximum a posteriori estimation in incomplete data models. In certain situations however, this method is not applicable because the expectation step cannot be performed in closed{form. To deal with these problems, a...
متن کاملA (2 + )-Approximation Algorithm for the Stochastic Knapsack Problem
The stochastic knapsack problem is a natural generalization of classical knapsack problem. In this problem, we are given a set of items each associated with a probability distribution on sizes and a profit, and a knapsack of unit capacity. The size of an item is unknown before inserting it into the knapsack, and it is revealed as soon as the item inserted into the knapsack. The objective is to ...
متن کاملCompetitive EM algorithm for finite mixture models
In this paper, we present a novel competitive EM (CEM) algorithm for "nite mixture models to overcome the two main drawbacks of the EM algorithm: often getting trapped at local maxima and sometimes converging to the boundary of the parameter space. The proposed algorithm is capable of automatically choosing the clustering number and selecting the “split” or “merge” operations e7ciently based on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastics and Stochastic Reports
سال: 1992
ISSN: 1045-1129
DOI: 10.1080/17442509208833797